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 28, 2026 20:24zielajzielajScore: 3,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 01:133,44254,863,56327,548,0001,020,0002,445,312
2Mar 28, 2026 20:233,44665,583,44627,578,0001,021,0002,523,136
3Mar 28, 2026 20:233,45051,301,10927,610,0001,022,0002,523,136
4Mar 28, 2026 20:243,45054,817,10227,612,0001,022,0002,486,272
5Mar 28, 2026 20:243,47352,760,69326,842,0001,988,0002,523,136
6Mar 29, 2026 01:133,47455,681,19526,847,0001,988,0002,486,272
7Mar 28, 2026 20:233,47552,023,61627,845,000994,0002,523,136
8Mar 29, 2026 01:133,47657,566,32826,858,0001,989,0002,523,136
9Mar 28, 2026 20:243,47853,152,36926,875,0001,990,0002,265,088