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 listJan 15, 2026 01:20Josu San MartinJosu San MartinScore: 78,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 01:2077,890675,269,497582,541,00063,949,0002,289,664
2Jan 15, 2026 01:2078,000679,627,889585,362,00062,038,0002,293,760
3Jan 15, 2026 01:2078,020676,018,264583,608,00063,957,0002,297,856