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 16, 2026 09:41Eric CeglieEric CeglieScore: 11,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 09:4111,457120,256,47394,090,0001,000,0002,289,664
2Mar 15, 2026 20:0311,509119,868,14594,516,0001,005,0002,289,664
3Mar 15, 2026 20:0311,519125,858,26494,603,0001,006,0002,289,664
4Mar 15, 2026 20:0311,521119,283,66094,616,0001,006,0002,449,408
5Mar 16, 2026 09:4111,539121,754,01993,779,0001,995,0002,355,200
6Mar 16, 2026 09:4111,563118,857,53493,973,0001,999,0002,453,504