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 31, 2026 12:36George SeabridgeGeorge SeabridgeScore: 69,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 12:3768,807581,113,943569,979,0001,122,0002,117,632
2Jul 31, 2026 12:3768,856581,470,398570,376,0001,137,0002,117,632
3Jul 31, 2026 12:3769,167584,103,295572,930,0001,163,0002,117,632
4Jul 31, 2026 12:3769,224584,611,698573,363,0001,198,0002,117,632
5Jul 31, 2026 12:3769,521587,120,631575,970,0001,062,0002,117,632
6Jul 31, 2026 12:3769,589587,739,744576,422,0001,168,0002,117,632
7Jul 31, 2026 12:3769,624587,963,051576,698,0001,186,0002,117,632
8Jul 31, 2026 12:3769,631587,970,067576,800,0001,141,0002,117,632
9Jul 31, 2026 12:3769,688588,426,890577,198,0001,213,0002,117,632