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 20:12javivallejojavivallejoScore: 75,086Success
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 20:1274,941647,734,548560,012,00062,001,0002,277,376
2Feb 2, 2026 20:1274,962643,293,008570,170,00052,015,0002,318,336
3Feb 2, 2026 20:1274,984649,075,374557,326,00065,038,0002,322,432
4Feb 2, 2026 20:1275,085648,263,840563,184,00060,019,0002,322,432
5Feb 2, 2026 20:1275,086646,885,375557,190,00066,022,0002,277,376
6Feb 2, 2026 20:1275,088649,886,943565,206,00058,021,0002,322,432
7Feb 2, 2026 20:1275,124650,172,041567,571,00055,957,0002,277,376
8Feb 2, 2026 20:1275,204650,146,714572,179,00052,016,0002,277,376
9Feb 2, 2026 20:1275,367652,743,782584,580,00040,970,0002,277,376