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 22, 2026 16:31Dominique GarmierDominique GarmierScore: 77,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:0276,857663,387,796634,911,0002,999,0002,334,720
2Mar 22, 2026 20:0276,961668,414,340636,778,0001,999,0002,322,432
3Mar 22, 2026 16:3177,019659,184,260637,254,0002,000,0002,306,048
4Mar 22, 2026 20:1277,206666,103,356636,812,0003,998,0002,334,720
5Mar 22, 2026 20:0277,272671,609,324639,357,0002,001,0002,342,912
6Mar 22, 2026 20:1277,299677,853,405638,581,0002,998,0002,347,008
7Mar 22, 2026 16:3177,314672,916,659639,704,0001,999,0002,347,008
8Mar 22, 2026 20:1277,408679,955,312639,489,0002,997,0002,314,240
9Mar 22, 2026 16:3177,897674,988,932643,546,0002,997,0002,318,336