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 30, 2026 03:16Josu San MartinJosu San MartinScore: 8,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:168,71894,975,42470,347,0002,009,0002,318,336
2Jan 30, 2026 03:168,769100,606,61469,790,0002,991,0002,322,432
3Jan 30, 2026 03:168,84798,401,56071,419,0002,011,0002,330,624
4Jan 30, 2026 03:168,928101,206,25671,095,0003,004,0002,330,624
5Jan 30, 2026 03:168,930100,926,99071,118,0003,005,0002,326,528
6Jan 30, 2026 03:169,490114,552,99576,777,0001,994,0002,314,240