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 23, 2026 02:53Alyssa VerkadeAlyssa VerkadeScore: 100,941Success
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 02:53100,643859,622,394606,522,000228,819,0002,342,912
2Mar 23, 2026 02:53100,681859,256,245606,747,000228,904,0002,531,328
3Mar 23, 2026 02:53100,702861,294,195607,872,000227,952,0002,355,200
4Mar 23, 2026 02:53100,798859,966,209604,729,000231,896,0002,310,144
5Mar 23, 2026 02:53100,941860,703,505605,863,000231,947,0002,478,080
6Mar 23, 2026 02:53101,108864,177,851606,421,000232,778,0002,392,064
7Mar 23, 2026 02:53101,203867,129,463608,268,000231,721,0002,465,792
8Mar 23, 2026 02:53101,220873,201,204610,363,000229,760,0002,412,544
9Mar 23, 2026 02:53101,230870,153,277608,428,000231,782,0002,281,472