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 listOct 18, 2026 09:30KacpxerKacpxerScore: 5,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 09:305,17953,724,99341,951,0001,041,0002,117,632
2Oct 18, 2026 09:305,21454,232,42142,254,0001,024,0002,117,632
3Oct 18, 2026 09:305,25654,283,43042,603,0001,025,0002,117,632
4Oct 18, 2026 09:305,30154,716,60742,961,0001,042,0002,117,632
5Oct 18, 2026 09:305,32955,004,59943,191,0001,042,0002,117,632
6Oct 18, 2026 09:305,35355,169,47743,396,0001,042,0002,117,632
7Oct 18, 2026 09:305,35555,157,97743,420,0001,032,0002,117,632
8Oct 18, 2026 09:305,36655,295,97943,498,0001,045,0002,117,632
9Oct 18, 2026 09:305,42855,794,78744,009,0001,047,0002,117,632