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 18:34zielajzielajScore: 3,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 01:433,50253,821,75127,059,0002,004,0002,523,136
2Mar 23, 2026 01:433,51354,427,65527,148,0002,010,0002,523,136
3Mar 23, 2026 01:413,51558,100,37127,161,0002,011,0002,523,136
4Mar 23, 2026 01:413,51655,792,76927,171,0002,012,0002,441,216
5Mar 22, 2026 18:343,52056,583,44327,203,0002,015,0002,519,040
6Mar 22, 2026 18:343,54549,731,63228,408,0001,014,0002,437,120
7Mar 22, 2026 18:343,62353,787,88328,065,0002,004,0002,519,040
8Mar 23, 2026 01:433,62651,955,36528,089,0002,006,0002,445,312
9Mar 23, 2026 01:413,63251,091,01628,134,0002,009,0002,441,216