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 listAug 2, 2026 18:45TonyTonyScore: 12,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:4612,319112,154,01279,355,00022,894,0002,113,536
2Aug 2, 2026 18:4612,364112,491,33879,685,00022,943,0002,113,536
3Aug 2, 2026 18:4612,376112,588,28479,696,00023,033,0002,113,536
4Aug 2, 2026 18:4612,414112,928,36580,168,00022,873,0002,113,536
5Aug 2, 2026 18:4612,417112,960,89280,024,00023,045,0002,113,536
6Aug 2, 2026 18:4612,430113,038,61280,225,00022,944,0002,113,536
7Aug 2, 2026 18:4612,438113,106,19180,369,00022,867,0002,113,536
8Aug 2, 2026 18:4612,457113,249,61580,533,00022,867,0002,113,536
9Aug 2, 2026 18:4612,465113,318,35680,477,00022,987,0002,113,536