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 listMay 4, 2026 22:44olliecrowolliecrowScore: 6,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 22:466,21866,278,55249,554,0002,060,0002,486,272
2May 4, 2026 22:466,25668,242,56549,867,0002,062,0002,469,888
3May 4, 2026 22:466,26370,014,73848,933,0003,051,0002,400,256
4May 4, 2026 22:466,26466,087,76848,959,0003,039,0002,486,272
5May 4, 2026 22:466,31266,317,04850,316,0002,077,0002,535,424
6May 4, 2026 22:466,32566,534,10149,398,0003,105,0002,375,680
7May 4, 2026 22:466,33172,227,25649,445,0003,106,0002,490,368
8May 4, 2026 22:466,37369,061,94350,833,0002,064,0002,404,352
9May 4, 2026 22:466,40872,046,22350,151,0003,037,0002,453,504