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 listJul 3, 2026 16:51Josu San MartinJosu San MartinScore: 37,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:5137,517320,767,635310,390,0001,005,0002,113,536
2Jul 3, 2026 16:5137,518320,787,021310,404,0001,002,0002,113,536
3Jul 3, 2026 16:5137,518320,876,243310,402,0001,004,0002,113,536
4Jul 3, 2026 16:5137,519320,961,171310,407,0001,005,0002,113,536
5Jul 3, 2026 16:5137,523320,837,453310,442,0001,004,0002,113,536
6Jul 3, 2026 16:5137,531321,867,976310,509,0001,004,0002,113,536
7Jul 3, 2026 16:5137,534321,022,608310,533,0001,004,0002,113,536
8Jul 3, 2026 16:5137,535321,037,334310,545,0001,003,0002,113,536
9Jul 3, 2026 16:5137,543321,004,199310,612,0001,003,0002,113,536