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 listMar 6, 2026 17:14Josu San MartinJosu San MartinScore: 5,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:145,40273,354,69642,846,0001,992,0002,416,640
2Mar 6, 2026 17:145,76571,054,96645,859,0001,993,0002,281,472
3Mar 6, 2026 17:145,82569,176,68647,341,0001,007,0002,408,448
4Mar 6, 2026 17:145,86186,578,08847,632,0001,013,0002,281,472
5Mar 6, 2026 17:145,88075,489,67246,810,0001,991,0002,277,376
6Mar 6, 2026 17:145,89573,245,17846,935,0001,997,0002,408,448