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 2, 2026 17:29Andrey TsvetkovAndrey TsvetkovScore: 47,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:3147,542405,681,807392,521,0002,085,0002,138,112
2Aug 2, 2026 17:3147,574404,932,669392,630,0002,235,0002,138,112
3Aug 2, 2026 17:3147,650405,340,763393,478,0002,022,0002,138,112
4Aug 2, 2026 17:3147,663406,658,543392,549,0003,062,0002,138,112
5Aug 2, 2026 17:3147,665408,689,984393,408,0002,214,0002,138,112
6Aug 2, 2026 17:3147,671407,230,922392,427,0003,248,0002,138,112
7Aug 2, 2026 17:3147,675406,685,243392,461,0003,249,0002,138,112
8Aug 2, 2026 17:3147,718406,824,058393,849,0002,218,0002,138,112
9Aug 2, 2026 17:3147,737407,200,801393,973,0002,251,0002,138,112