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 listApr 20, 2026 22:18Josu San MartinJosu San MartinScore: 5,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:195,61773,120,78545,612,0001,013,0002,277,376
2Apr 20, 2026 22:195,64169,176,25644,835,0001,992,0002,367,488
3Apr 20, 2026 22:195,66268,454,90945,002,0002,000,0002,375,680
4Apr 20, 2026 22:195,73578,222,74746,595,0001,012,0002,277,376
5Apr 20, 2026 22:195,79172,907,83946,068,0002,002,0002,387,968
6Apr 20, 2026 22:195,83271,094,19947,398,0001,008,0002,375,680
7Apr 20, 2026 22:195,84568,190,71248,514,00002,371,584
8Apr 20, 2026 22:195,87977,235,41246,809,0001,991,0002,379,776
9Apr 20, 2026 22:195,94360,493,80647,316,0002,013,0002,277,376