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 listMay 9, 2026 22:35Josu San MartinJosu San MartinScore: 4,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:354,72753,243,00038,169,0001,066,0002,445,312
2May 9, 2026 22:354,80153,603,11538,652,0001,203,0002,453,504
3May 9, 2026 22:354,83354,483,79739,054,0001,061,0002,441,216
4May 9, 2026 22:354,88456,624,74839,451,0001,087,0002,449,408
5May 9, 2026 22:354,89357,123,73039,445,0001,174,0002,449,408
6May 9, 2026 22:354,90562,658,52639,552,0001,161,0002,326,528
7May 9, 2026 22:354,92856,372,85939,813,0001,092,0002,445,312
8May 9, 2026 22:354,99456,634,44240,333,0001,119,0002,449,408
9May 9, 2026 22:354,99455,312,15040,424,0001,030,0002,449,408