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 02:09Josu San MartinJosu San MartinScore: 78,021Success
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 02:0977,974682,223,630585,169,00062,017,0002,547,712
2Jan 15, 2026 02:0978,021675,590,423584,613,00062,958,0002,297,856
3Jan 15, 2026 02:0978,107680,668,459588,351,00059,933,0002,547,712