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 31, 2026 13:10skylookupskylookupScore: 367,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 13:10367,4453,073,870,2392,991,814,00057,977,0002,289,664
2Mar 31, 2026 13:10367,7183,078,269,7912,994,094,00057,963,0002,289,664
3Mar 31, 2026 13:10376,5863,153,551,2313,060,712,00064,951,0002,293,760