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 listSep 24, 2026 08:19wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:190620,914,032611,101,0001,054,0002,113,536expected "53686250121301020 ", got "18446744073709551010 53686250121301020 25295816611 524128560 0 11916 10107 12001 12003 10106 11929 31386 31585 26604 26329 26314 "
2Sep 24, 2026 08:190622,205,927611,801,0001,011,0002,113,536expected "53687069115991226 ", got "18446744073709551010 53687069115991226 25296051567 524131045 0 11884 10112 11907 11917 10113 11886 31295 31372 26633 26339 26331 "
3Sep 24, 2026 08:190623,385,982613,525,0001,071,0002,113,536expected "53682280638494017 ", got "18446744073709551010 53682280638494017 25295864444 524127229 0 11782 10167 11704 11808 10135 11796 31257 31294 26907 26590 26505 "