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 17, 2026 23:02zielajzielajScore: 3,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 22:593,48953,125,58926,963,0001,997,0002,527,232
2Mar 17, 2026 22:593,50052,538,89327,043,0002,003,0002,441,216
3Mar 17, 2026 22:593,50547,064,94627,089,0002,006,0002,478,080
4Mar 17, 2026 23:023,50750,183,69427,100,0002,007,0002,519,040
5Mar 17, 2026 22:593,51053,456,40327,121,0002,008,0002,519,040
6Mar 17, 2026 22:593,51154,007,20427,135,0002,010,0002,514,944
7Mar 17, 2026 23:023,51957,496,71427,194,0002,014,0002,519,040
8Mar 17, 2026 22:593,52452,542,03627,233,0002,017,0002,437,120
9Mar 17, 2026 23:023,54652,367,21928,417,0001,014,0002,260,992