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 listJul 26, 2026 21:44boop34boop34Score: 38,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 21:4438,352328,445,022312,078,0006,244,00020,480
2Jul 26, 2026 21:4438,468330,130,529311,974,0007,316,0002,113,536
3Jul 26, 2026 21:4438,565332,558,014312,796,0007,296,00020,480
4Jul 26, 2026 21:4438,579331,442,683312,059,0008,154,0002,113,536
5Jul 26, 2026 21:4438,592330,381,291312,028,0008,292,00020,480
6Jul 26, 2026 21:4438,626330,657,048312,319,0008,281,00020,480
7Jul 26, 2026 21:4438,627330,722,537312,287,0008,324,0002,113,536
8Jul 26, 2026 21:4438,749331,648,243312,587,0009,037,0002,113,536
9Jul 26, 2026 21:4438,770332,021,385313,119,0008,680,0002,113,536