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 12, 2026 23:41Jarry XiaoJarry XiaoScore: 36,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 23:4136,450312,619,709300,411,0002,128,0002,129,920
2Jul 12, 2026 23:4136,454312,564,876301,567,0001,005,0002,129,920
3Jul 12, 2026 23:4136,455312,276,741301,578,0001,004,0002,129,920
4Jul 12, 2026 23:4136,461312,229,635300,503,0002,128,0002,129,920
5Jul 12, 2026 23:4136,463312,279,536300,508,0002,141,0002,129,920
6Jul 12, 2026 23:4136,466313,704,596301,666,0001,004,0002,129,920
7Jul 12, 2026 23:4136,466312,349,059301,664,0001,004,0002,129,920
8Jul 12, 2026 23:4136,471312,299,704300,566,0002,147,0002,129,920
9Jul 12, 2026 23:4136,472312,520,540300,603,0002,122,0002,129,920