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 listMar 10, 2026 16:45caandocaandoScore: 5,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:455,05865,569,22639,983,0001,999,0002,506,752
2Mar 10, 2026 16:455,06570,103,57141,039,0001,000,0002,285,568
3Mar 10, 2026 16:455,10964,584,45338,364,0004,038,0002,523,136
4Mar 10, 2026 16:455,13171,965,26441,575,0001,014,0002,285,568
5Mar 10, 2026 16:455,17271,040,93841,933,000998,0002,519,040
6Mar 10, 2026 16:455,19069,002,91540,076,0003,005,0002,519,040