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 listFeb 2, 2026 22:31javivallejojavivallejoScore: 44,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:3144,244394,223,933366,228,0001,000,0002,289,664
2Feb 2, 2026 22:3144,252389,353,381367,293,00002,281,472
3Feb 2, 2026 22:3144,256389,507,585367,326,00002,265,088
4Feb 2, 2026 22:3144,259394,792,897366,351,0001,000,0002,289,664
5Feb 2, 2026 22:3144,260388,358,585366,358,0001,000,0002,510,848
6Feb 2, 2026 22:3144,261395,789,612367,366,00002,269,184
7Feb 2, 2026 22:3144,261392,603,761366,367,0001,001,0002,273,280
8Feb 2, 2026 22:3144,285393,891,678365,569,0001,997,0002,269,184
9Feb 2, 2026 22:3144,289396,820,100366,604,000998,0002,289,664