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 14, 2026 20:37Kevin HeaveyKevin HeaveyScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:393,69240,298,43929,619,0001,027,0002,117,632
2Jul 14, 2026 20:393,69440,308,65329,639,0001,022,0002,117,632
3Jul 14, 2026 20:393,70540,400,35429,730,0001,024,0002,117,632
4Jul 14, 2026 20:393,71040,358,89529,769,0001,026,0002,117,632
5Jul 14, 2026 20:393,71140,441,94929,780,0001,028,0002,117,632
6Jul 14, 2026 20:395,38754,409,36243,697,0001,018,0002,117,632
7Jul 14, 2026 20:395,46355,012,24044,324,0001,021,0002,117,632
8Jul 14, 2026 20:395,50255,333,66544,643,0001,029,0002,117,632
9Jul 14, 2026 20:395,58555,919,38745,340,0001,020,0002,117,632