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 listApr 24, 2026 07:56Dominique GarmierDominique GarmierScore: 96,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 07:5795,135806,913,059786,630,0002,998,0002,506,752stderr
2Apr 24, 2026 07:5795,333810,810,203789,265,0002,000,0002,510,848stderr
3Apr 24, 2026 07:5795,616812,101,700790,615,0002,998,0002,375,680stderr
4Apr 24, 2026 07:5795,728814,292,828791,549,0002,998,0002,375,680stderr
5Apr 24, 2026 07:5796,152823,365,526795,068,0003,000,0002,379,776stderr
6Apr 24, 2026 07:5796,274815,563,107797,077,0002,000,0002,375,680stderr
7Apr 24, 2026 07:5796,890824,746,422801,189,0003,000,0002,535,424stderr
8Apr 24, 2026 07:5797,015820,623,938803,231,0002,000,0002,371,584stderr
9Apr 24, 2026 07:5797,239823,967,439805,088,0002,000,0002,510,848stderr