Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 19, 2026 16:51A_ShamanA_ShamanScore: 47,144Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:5247,020399,401,373319,954,00070,318,0002,113,536
2Jun 19, 2026 16:5247,052399,675,673320,017,00070,518,0002,113,536
3Jun 19, 2026 16:5247,076399,895,237320,085,00070,654,0002,113,536
4Jun 19, 2026 16:5247,109400,042,329320,069,00070,938,0002,113,536
5Jun 19, 2026 16:5247,144400,505,339320,141,00071,162,0002,113,536
6Jun 19, 2026 16:5247,162400,553,600320,104,00071,347,0002,113,536
7Jun 19, 2026 16:5247,210400,915,400320,068,00071,783,0002,113,536
8Jun 19, 2026 16:5247,409403,181,648321,773,00071,729,0002,113,536
9Jun 19, 2026 16:5247,424403,323,131321,949,00071,675,0002,113,536