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 20, 2026 17:21Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:21057,200,78245,482,0001,015,0002,117,632Exit with code 1: diag8180 label=lseek bytes=524128058 cycles=3572 bytes_per_kcycle=146732379 checksum=524128058 diag8180 label=mmap_populate bytes=524128058 cycles=958304 bytes_per_kcycle=546932 checksum=136029426155520 diag8180 label=full_correct byt...stderr