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 1, 2026 14:58George SeabridgeGeorge SeabridgeScore: 72,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 14:5860,204509,603,103498,692,0001,007,0002,113,536
2Aug 1, 2026 14:5860,231509,900,394498,842,0001,079,0002,113,536
3Aug 1, 2026 14:5860,271510,682,451499,248,0001,004,0002,113,536
4Aug 1, 2026 14:5866,204559,479,623548,408,0001,089,0002,113,536
5Aug 1, 2026 14:5872,020607,775,435596,677,0001,089,0002,113,536
6Aug 1, 2026 14:5872,386610,813,440599,673,0001,135,0002,113,536
7Aug 1, 2026 14:5872,473611,601,841600,402,0001,126,0002,113,536
8Aug 1, 2026 14:5880,123675,061,592663,945,0001,083,0002,113,536
9Aug 1, 2026 14:5882,025690,826,409678,631,0002,181,0002,113,536