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 listJul 27, 2025 02:27Marco BarboneMarco BarboneScore: 73,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 02:2773,890638,232,510613,289,00002,465,792
2Jul 27, 2025 02:2773,936639,081,413612,671,000999,0002,273,280
3Jul 27, 2025 02:2773,947637,408,203608,759,0004,998,0002,269,184
4Jul 27, 2025 02:2773,954639,619,943612,822,000999,0002,273,280
5Jul 27, 2025 02:2773,968636,714,169611,938,0001,999,0002,473,984
6Jul 27, 2025 02:2773,970641,235,775612,951,000999,0002,461,696
7Jul 27, 2025 02:2773,987643,088,096613,090,000998,0002,469,888
8Jul 27, 2025 02:2774,007640,763,615613,258,0001,000,0002,465,792
9Jul 27, 2025 02:2774,099639,921,415612,019,0003,000,0002,273,280