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 listAug 1, 2026 17:35boop34boop34Score: 8,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 17:358,31578,955,09067,822,0001,198,0002,113,536
2Aug 1, 2026 17:358,38779,590,62068,610,0001,008,0002,113,536
3Aug 1, 2026 17:358,39079,643,42668,432,0001,205,0002,113,536
4Aug 1, 2026 17:358,39180,872,64568,443,0001,208,0002,113,536
5Aug 1, 2026 17:358,44380,303,02268,859,0001,226,0002,113,536
6Aug 1, 2026 17:358,44980,084,47368,906,0001,228,0002,113,536
7Aug 1, 2026 17:358,45580,092,11068,976,0001,207,0002,113,536
8Aug 1, 2026 17:358,47680,268,16269,150,0001,208,0002,113,536
9Aug 1, 2026 17:358,54781,214,07469,890,0001,057,0002,113,536